Search results for "Equivalence class"
showing 8 items of 8 documents
A Neurocomputational Approach to Trained and Transitive Relations in Equivalence Classes
2017
A stimulus class can be composed of perceptually different but functionally equivalent stimuli. The relations between the stimuli that are grouped in a class can be learned or derived from other stimulus relations. If stimulus A is equivalent to B, and B is equivalent to C, then the equivalence between A and C can be derived without explicit training. In this work we propose, with a neurocomputational model, a basic learning mechanism for the formation of equivalence. We also describe how the relatedness between the members of an equivalence class is developed for both trained and derived stimulus relations. Three classic studies on stimulus equivalence are simulated covering typical and at…
An Overview on Algebraic Structures
2016
This chapter recaps and formalizes concepts used in the previous sections of this book. Furthermore, this chapter reorganizes and describes in depth the topics mentioned at the end of Chap. 1, i.e. a formal characterization of the abstract algebraic structures and their hierarchy. This chapter is thus a revisited summary of concepts previously introduced and used and provides the mathematical basis for the following chapters.
Equivalence classes of permutations modulo excedances
2014
International audience
Color and Timbre Gestures: An Approach with Bicategories and Bigroupoids
2022
White light can be decomposed into different colors, and a complex sound wave can be decomposed into its partials. While the physics behind transverse and longitudinal waves is quite different and several theories have been developed to investigate the complexity of colors and timbres, we can try to model their structural similarities through the language of categories. Then, we consider color mixing and color transition in painting, comparing them with timbre superposition and timbre morphing in orchestration and computer music in light of bicategories and bigroupoids. Colors and timbres can be a probe to investigate some relevant aspects of visual and auditory perception jointly with thei…
Convergence-theoretic characterizations of compactness
2002
AbstractFundamental variants of compactness are characterized in terms of concretely reflective convergence subcategories: topologies, pretopologies, paratopologies, hypotopologies and pseudotopologies. Hyperquotient maps (perfect, quasi-perfect, adherent and closed) and quotient maps (quotient, hereditarily quotient, countably biquotient, biquotient, and almost open) are characterized in terms of various degrees of compactness of their fiber relations, and of sundry relaxations of inverse continuity.
Equivalence classes of permutations modulo descents and left-to-right maxima
2014
Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.
A NOTE ON THE CATEGORICAL NOTIONS OF NORMAL SUBOBJECT AND OF EQUIVALENCE CLASS
2021
In a non-pointed category E, a subobject which is normal to an equivalence relation is not necessarily an equivalence class. We elaborate this categorical distinction, with a special attention to the Mal'tsev context. Moreover, we introduce the notion of fibrant equipment, and we use it to establish some conditions ensuring the uniqueness of an equivalence relation to which a given subobject is normal, and to give a description of such a relation.
Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm
2020
In 1996, Bodlaender showed the celebrated result that an optimal tree decomposition of a graph of bounded treewidth can be found in linear time. The algorithm is based on an algorithm of Bodlaender and Kloks that computes an optimal tree decomposition given a non-optimal tree decomposition of bounded width. Both algorithms, in particular the second, are hardly accessible. We present the second algorithm in a much simpler way in this paper and refer to an extended version for the first. In our description of the second algorithm, we start by explaining how all tree decompositions of subtrees defined by the nodes of the given tree decomposition can be enumerated. We group tree decompositions …